288 research outputs found
Depth-Independent Lower bounds on the Communication Complexity of Read-Once Boolean Formulas
We show lower bounds of and on the
randomized and quantum communication complexity, respectively, of all
-variable read-once Boolean formulas. Our results complement the recent
lower bound of by Leonardos and Saks and
by Jayram, Kopparty and Raghavendra for
randomized communication complexity of read-once Boolean formulas with depth
. We obtain our result by "embedding" either the Disjointness problem or its
complement in any given read-once Boolean formula.Comment: 5 page
Information complexity of the AND function in the two-Party, and multiparty settings
In a recent breakthrough paper [M. Braverman, A. Garg, D. Pankratov, and O.
Weinstein, From information to exact communication, STOC'13] Braverman et al.
developed a local characterization for the zero-error information complexity in
the two party model, and used it to compute the exact internal and external
information complexity of the 2-bit AND function, which was then applied to
determine the exact asymptotic of randomized communication complexity of the
set disjointness problem.
In this article, we extend their results on AND function to the multi-party
number-in-hand model by proving that the generalization of their protocol has
optimal internal and external information cost for certain distributions. Our
proof has new components, and in particular it fixes some minor gaps in the
proof of Braverman et al
Proposed experiment for the quantum "Guess my number" protocol
An experimental realization of the entanglement-assisted "Guess my number"
protocol for the reduction of communication complexity, introduced by Steane
and van Dam, would require producing and detecting three-qubit GHZ states with
an efficiency eta > 0.70, which would require single photon detectors of
efficiency sigma > 0.89. We propose a modification of the protocol which can be
translated into a real experiment using present-day technology. In the proposed
experiment, the quantum reduction of the multi-party communication complexity
would require an efficiency eta > 0.05, achievable with detectors of sigma >
0.47, for four parties, and eta > 0.17 (sigma > 0.55) for three parties.Comment: REVTeX4, 4 pages, 1 figur
Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks
Development of many futuristic technologies, such as MANET, VANET, iThings,
nano-devices, depend on efficient distributed communication protocols in
multi-hop ad hoc networks. A vast majority of research in this area focus on
design heuristic protocols, and analyze their performance by simulations on
networks generated randomly or obtained in practical measurements of some
(usually small-size) wireless networks. %some library. Moreover, they often
assume access to truly random sources, which is often not reasonable in case of
wireless devices. In this work we use a formal framework to study the problem
of broadcasting and its time complexity in any two dimensional Euclidean
wireless network with uniform transmission powers. For the analysis, we
consider two popular models of ad hoc networks based on the
Signal-to-Interference-and-Noise Ratio (SINR): one with opportunistic links,
and the other with randomly disturbed SINR. In the former model, we show that
one of our algorithms accomplishes broadcasting in rounds, where
is the number of nodes and is the diameter of the network. If nodes
know a priori the granularity of the network, i.e., the inverse of the
maximum transmission range over the minimum distance between any two stations,
a modification of this algorithm accomplishes broadcasting in
rounds.
Finally, we modify both algorithms to make them efficient in the latter model
with randomly disturbed SINR, with only logarithmic growth of performance.
Ours are the first provably efficient and well-scalable, under the two
models, distributed deterministic solutions for the broadcast task.Comment: arXiv admin note: substantial text overlap with arXiv:1207.673
Interval Selection in the Streaming Model
A set of intervals is independent when the intervals are pairwise disjoint.
In the interval selection problem we are given a set of intervals
and we want to find an independent subset of intervals of largest cardinality.
Let denote the cardinality of an optimal solution. We
discuss the estimation of in the streaming model, where we
only have one-time, sequential access to the input intervals, the endpoints of
the intervals lie in , and the amount of the memory is
constrained.
For intervals of different sizes, we provide an algorithm in the data stream
model that computes an estimate of that, with
probability at least , satisfies . For same-length
intervals, we provide another algorithm in the data stream model that computes
an estimate of that, with probability at
least , satisfies . The space used by our algorithms is bounded
by a polynomial in and . We also show that no better
estimations can be achieved using bits of storage.
We also develop new, approximate solutions to the interval selection problem,
where we want to report a feasible solution, that use
space. Our algorithms for the interval selection problem match the optimal
results by Emek, Halld{\'o}rsson and Ros{\'e}n [Space-Constrained Interval
Selection, ICALP 2012], but are much simpler.Comment: Minor correction
Fast Structuring of Radio Networks for Multi-Message Communications
We introduce collision free layerings as a powerful way to structure radio
networks. These layerings can replace hard-to-compute BFS-trees in many
contexts while having an efficient randomized distributed construction. We
demonstrate their versatility by using them to provide near optimal distributed
algorithms for several multi-message communication primitives.
Designing efficient communication primitives for radio networks has a rich
history that began 25 years ago when Bar-Yehuda et al. introduced fast
randomized algorithms for broadcasting and for constructing BFS-trees. Their
BFS-tree construction time was rounds, where is the network
diameter and is the number of nodes. Since then, the complexity of a
broadcast has been resolved to be rounds. On the other hand, BFS-trees have been used as a crucial building
block for many communication primitives and their construction time remained a
bottleneck for these primitives.
We introduce collision free layerings that can be used in place of BFS-trees
and we give a randomized construction of these layerings that runs in nearly
broadcast time, that is, w.h.p. in rounds for any constant . We then use these
layerings to obtain: (1) A randomized algorithm for gathering messages
running w.h.p. in rounds. (2) A randomized -message
broadcast algorithm running w.h.p. in rounds. These
algorithms are optimal up to the small difference in the additive
poly-logarithmic term between and . Moreover, they imply the
first optimal round randomized gossip algorithm
On the Communication Complexity of Secure Computation
Information theoretically secure multi-party computation (MPC) is a central
primitive of modern cryptography. However, relatively little is known about the
communication complexity of this primitive.
In this work, we develop powerful information theoretic tools to prove lower
bounds on the communication complexity of MPC. We restrict ourselves to a
3-party setting in order to bring out the power of these tools without
introducing too many complications. Our techniques include the use of a data
processing inequality for residual information - i.e., the gap between mutual
information and G\'acs-K\"orner common information, a new information
inequality for 3-party protocols, and the idea of distribution switching by
which lower bounds computed under certain worst-case scenarios can be shown to
apply for the general case.
Using these techniques we obtain tight bounds on communication complexity by
MPC protocols for various interesting functions. In particular, we show
concrete functions that have "communication-ideal" protocols, which achieve the
minimum communication simultaneously on all links in the network. Also, we
obtain the first explicit example of a function that incurs a higher
communication cost than the input length in the secure computation model of
Feige, Kilian and Naor (1994), who had shown that such functions exist. We also
show that our communication bounds imply tight lower bounds on the amount of
randomness required by MPC protocols for many interesting functions.Comment: 37 page
Quantum Algorithms for Learning and Testing Juntas
In this article we develop quantum algorithms for learning and testing
juntas, i.e. Boolean functions which depend only on an unknown set of k out of
n input variables. Our aim is to develop efficient algorithms:
- whose sample complexity has no dependence on n, the dimension of the domain
the Boolean functions are defined over;
- with no access to any classical or quantum membership ("black-box")
queries. Instead, our algorithms use only classical examples generated
uniformly at random and fixed quantum superpositions of such classical
examples;
- which require only a few quantum examples but possibly many classical
random examples (which are considered quite "cheap" relative to quantum
examples).
Our quantum algorithms are based on a subroutine FS which enables sampling
according to the Fourier spectrum of f; the FS subroutine was used in earlier
work of Bshouty and Jackson on quantum learning. Our results are as follows:
- We give an algorithm for testing k-juntas to accuracy that uses
quantum examples. This improves on the number of examples used
by the best known classical algorithm.
- We establish the following lower bound: any FS-based k-junta testing
algorithm requires queries.
- We give an algorithm for learning -juntas to accuracy that
uses quantum examples and
random examples. We show that this learning algorithms is close to optimal by
giving a related lower bound.Comment: 15 pages, 1 figure. Uses synttree package. To appear in Quantum
Information Processin
Non-local correlations as an information theoretic resource
It is well known that measurements performed on spatially separated entangled
quantum systems can give rise to correlations that are non-local, in the sense
that a Bell inequality is violated. They cannot, however, be used for
super-luminal signalling. It is also known that it is possible to write down
sets of ``super-quantum'' correlations that are more non-local than is allowed
by quantum mechanics, yet are still non-signalling. Viewed as an information
theoretic resource, super-quantum correlations are very powerful at reducing
the amount of communication needed for distributed computational tasks. An
intriguing question is why quantum mechanics does not allow these more powerful
correlations. We aim to shed light on the range of quantum possibilities by
placing them within a wider context. With this in mind, we investigate the set
of correlations that are constrained only by the no-signalling principle. These
correlations form a polytope, which contains the quantum correlations as a
(proper) subset. We determine the vertices of the no-signalling polytope in the
case that two observers each choose from two possible measurements with d
outcomes. We then consider how interconversions between different sorts of
correlations may be achieved. Finally, we consider some multipartite examples.Comment: Revtex. 12 pages, 6 figure
Violation of Bell's inequality: criterion for quantum communication complexity advantage
We prove that for every Bell's inequality and for a broad class of protocols,
there always exists a multi-party communication complexity problem, for which
the protocol assisted by states which violate the inequality is more efficient
than any classical protocol. Moreover, for that advantage Bell's inequality
violation is a necessary and sufficient criterion. Thus, violation of Bell's
inequalities has a significance beyond that of a non-optimal-witness of
non-separability.Comment: 4 pages, 1 figur
- …